Sound Reasoning about Integral Data Types with a Reusable SMT Solver Interface R´egis Blanc Viktor Kuncak

Source URL: lampwww.epfl.ch

• Functional languages
• Data types
• Scala
• Satisfiability modulo theories
• Integer
• Lebesgue integration
• Antiderivative
• cole Polytechnique Fdrale de Lausanne

Mostly-Automated Verification of Low-Level Programs in Computational Separation Logic Adam Chlipala Harvard University PLDI 2011

Source URL: adam.chlipala.net

• Theoretical computer science
• Logic in computer science
• Formal methods
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories
• Separation logic
• Mathematical logic
• Logic programming
• Logic

Commoditizing Verification

Source URL: homes.cs.washington.edu

• Formal methods
• Logic in computer science
• Systems engineering
• Theoretical computer science
• Formal verification
• ESC/Java
• Verification
• Satisfiability modulo theories

Accelerating lemma learning using joins - DPLL(t) Nikolaj Bjørner Microsoft Research Bruno Dutertre SRI International

Source URL: yices.csl.sri.com

• Theoretical computer science
• Mathematical logic
• Automated theorem proving
• Mathematics
• Formal methods
• Logic in computer science
• Constraint programming
• Electronic design automation
• Conflict-Driven Clause Learning
• DPLL algorithm
• Boolean satisfiability problem
• Satisfiability modulo theories

Event-B & Cloud Provers A. Iliasov D. Adjepon-Yamoah P. Stankaitis

Source URL: www.ai4fm.org

• Software
• Theoretical computer science
• Formal methods
• Logic in computer science
• Automated theorem proving
• Constraint programming
• Predicate logic
• Frama-C
• Satisfiability modulo theories
• TPTP
• Mereology
• SPASS

LNCSA Tutorial on Satisfiability Modulo Theories

Source URL: yices.csl.sri.com

• Theoretical computer science
• Mathematical logic
• Mathematics
• Constraint programming
• Automated theorem proving
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• DPLL algorithm
• Symbol
• Conjunctive normal form

Satisfiability Modulo Theories: ABsolver Michael Tautschnig Joint work with: Andreas Bauer Martin Leucker

Source URL: www.tautschnig.net

A Fast Linear-Arithmetic Solver for DPLL(T) Bruno Dutertre and Leonardo de Moura Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, USA {bruno, demoura}@csl.sri.com

Source URL: yices.csl.sri.com

• Theoretical computer science
• Logic
• Mathematics
• Constraint programming
• Electronic design automation
• Formal methods
• Logic in computer science
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Simplex algorithm
• Satisfiability

Optgen: A Generator for Local Optimizations Sebastian Buchwald Karlsruhe Institute of Technology Abstract. Every compiler comes with a set of local optimization rules,

Source URL: pp.info.uni-karlsruhe.de

• Software
• Compiler optimizations
• Computer programming
• Peephole optimization
• Superoptimization
• Constant folding
• Compiler
• Program optimization
• Satisfiability modulo theories
• Expression
• Static single assignment form
• GNU Compiler Collection

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC